Computational Complexity of Iterated Maps on the Interval (Extended Abstract)
نویسنده
چکیده
The exact computation of orbits of discrete dynamical systems on the interval is considered. Therefore, a multiple-precision floating point approach based on error analysis is chosen and a general algorithm is presented. The correctness of the algorithm is shown and the computational complexity is analyzed. As a main result, the computational complexity measure considered here is related to the Ljapunow exponent of the dynamical system under consideration.
منابع مشابه
Computational Complexity of Iterated Maps on the Interval
The correct computation of orbits of discrete dynamical systems on the interval is considered. Therefore, an arbitrary-precision floating-point approach based on automatic error analysis is chosen and a general algorithm is presented. The correctness of the algorithm is shown and the computational complexity is analyzed. There are two main results. First, the computational complexity measure co...
متن کاملToeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms (Extended Abstract)
We consider so-called Toeplitz words which can be viewed as generalizations of one-way innnite periodic words. We compute their subword complexity, and show that they can always be generated by iterating periodically a nite number of morphisms. Moreover, we deene a structural classiication of Toeplitz words which is reeected in the way how they can be generated by iterated morphisms.
متن کاملHausdorff Dimension of Fractals Generated from Step-wise Adjustable Iterated Function Systems
Iterated function systems have been powerful tools to generate fractals. However, the requirement of using the same maps at every iteration results in a fractal that may be too self-similar for certain applications. We present a construction in which the maps are allowed to be updated at each iteration in order to generate more general fractals without changing the computational complexity. We ...
متن کاملIMPLEMENTATION OF EXTENDED KALMAN FILTER TO REDUCE NON CYCLO-STATIONARY NOISE IN AERIAL GAMMA RAY SURVEY
Gamma-ray detection has an important role in the enhancement the nuclear safety and provides a proper environment for applications of nuclear radiation. To reduce the risk of exposure, aerial gamma survey is commonly used as an advantage of the distance between the detection system and the radiation sources. One of the most important issues in aerial gamma survey is the detection noise. Various...
متن کاملAn Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010